Graphical Optimization and Inverse Planning Simulated Annealing: A Dosimetric Study for Cervix Brachytherapy Treatments
نویسندگان
چکیده
منابع مشابه
IPIP: A new approach to inverse planning for HDR brachytherapy by directly optimizing dosimetric indices.
PURPOSE Many planning methods for high dose rate (HDR) brachytherapy require an iterative approach. A set of computational parameters are hypothesized that will give a dose plan that meets dosimetric criteria. A dose plan is computed using these parameters, and if any dosimetric criteria are not met, the process is iterated until a suitable dose plan is found. In this way, the dose distribution...
متن کاملDosimetric comparison of various optimization techniques for high dose rate brachytherapy of interstitial cervix implants
HDR brachytherapy treatment planning often involves optimization methods to calculate the dwell times and dwell positions of the radioactive source along specified afterloading catheters. The purpose of this study is to compare the dose distribution obtained with geometric optimization (GO) and volume optimization (VO) combined with isodose reshaping. This is a retrospective study of 10 cervix ...
متن کاملSimulated Annealing for Convex Optimization
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is specified only by a membership oracle. Using distributions from the Boltzmann-Gibbs family leads to an algorithm that needs only O∗( √ n) phases for instances in R. This gives an optimization algorithm that makes O∗(n4...
متن کاملOptimization by simulated annealing.
There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters). A detailed analogy with annealing in solids provides a framework for optimization of the properties of very ...
متن کاملSimulated Annealing and Global Optimization
Nelder-Mead (when you don’t know ∇f ) and steepest descent/conjugate gradient (when you do). Both of these methods are based on attempting to generate a sequence of positions xk with monotonically decreasing f(xk) in the hopes that the xk → x∗, the global minimum for f . If f is a convex function (this happens surprisingly often), and has only one local minimum, these methods are exactly the ri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Radiation Oncology*Biology*Physics
سال: 2019
ISSN: 0360-3016
DOI: 10.1016/j.ijrobp.2019.06.879